- Boolean complementation
- 1) операция дополнения булева дополнения2) образование булева дополнения
English-Russian dictionary of computer science and programming. 2013.
English-Russian dictionary of computer science and programming. 2013.
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean grammar — Boolean grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context free grammars, with conjunction and negation operations. Besides these explicit operations, Boolean grammars… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean algebra — A Boolean algebra is a system consisting of a set S and two operations, n and ? (cap and cup), subject to the following axioms. For all sets a,b,c, that are members of S: 1 a n (b n c) = (a n b) n c. Also a ? (b ? c) = (a ? b) ? c (associativity) … Philosophy dictionary
Boolean algebra — noun a) An algebra in which all elements can take only one of two values (typically 0 and 1, or true and false ) and are subject to operations based on AND, OR and NOT The set of divisors of 30, with binary operators: g.c.d. and l.c.m., unary… … Wiktionary
Two-element Boolean algebra — In mathematics and abstract algebra, the two element Boolean algebra is the Boolean algebra whose underlying set (or universe or carrier ) B is the Boolean domain. The elements of the Boolean domain are 1 and 0 by convention, so that B ={0,1}.… … Wikipedia
Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… … Wikipedia
Diagrammatic reasoning — is reasoning by means of visual representations. The study of diagrammatic reasoning is about the understanding of concepts and ideas, visualized with the use of diagrams and imagery instead of by linguistic or algebraic means. Contents 1 Related … Wikipedia
Existential graph — An existential graph is a type of diagrammatic or visual notation for logical expressions, proposed by Charles Sanders Peirce, who wrote his first paper on graphical logic in 1882 and continued to develop the method until his death in 1914.The… … Wikipedia
Entitative graph — An entitative graph is an element of the graphical syntax for logic that Charles Sanders Peirce developed under the name of qualitative logic beginning in the 1880 s, taking the coverage of the formalism only as far as the propositional or… … Wikipedia
Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia